package com.cjm.algorithm.array;

public class Ti702 {
    public static void main(String[] args) {
        // int[] nums = new int[] {-1, 0, 3, 5, 9, 12};
        int[] nums = new int[] {-1, 0, 3, 5, 9, 12};
        Ti702 t = new Ti702();
        System.err.println(t.search(nums, 2));
    }
    public int search(int[] nums, int target) {
        int left = 0, right = nums.length - 1;
        while (left <= right) {
            int mid = left + (right - left) / 2;
            if (nums[mid] > target) {
                right = mid - 1;
            } else if (nums[mid] < target) {
                left = mid + 1;
            } else {
                return mid;
            }
        }
        return -1;
    }
}
